Prüfer codes for hypertrees
نویسنده
چکیده
1: We describe a new Prüfer code which works also for infinite hypertrees.
منابع مشابه
Prüfer codes for acyclic hypertrees
We describe a new Prüfer code based on star-reductions which works for infinite acyclic hypertrees.
متن کاملPrüfer-Like Codes for Labeled Trees
In 1918 Prüfer showed a one-to-one correspondence between n-node labeled trees and (n – 2)-tuples of node labels. The proof employed a tree code, computed by iteratively deleting the leaf with the smallest label and recording its neighbor. Since then other tree codes have been proposed, based on different node deletion sequences. These codes have different properties, interesting and useful in ...
متن کاملDecorated hypertrees
C. Jensen, J. McCammond and J. Meier have used weighted hypertrees to compute the Euler characteristic of a subgroup of the automorphism group of a free product. Weighted hypertrees also appear in the study of the homology of the hypertree poset. We link them to decorated hypertrees after a general study on decorated hypertrees, which we enumerate using box trees.
متن کاملDecorated hypertrees
C. Jensen, J. McCammond and J. Meier have used weighted hypertrees to compute the Euler characteristic of a subgroup of the automorphism group of a free product. Weighted hypertrees also appear in the study of the homology of the hypertree poset. We link them to decorated hypertrees after a general study on decorated hypertrees, which we enumerate using box trees.
متن کاملA note on Prüfer-like coding and counting forests of uniform hypertrees
The present note is designing encoding and decoding algorithms for a forest of rooted uniform hypertrees and hypercycles in linear time, by using as little as n− 2 integers in the range [1, n]. This simple extension of the classical Prüfer code for rooted trees to an encoding for forests of rooted uniform hypertrees and hypercycles makes it possible to count them up, according to their number o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013